Error-Correcting Codes for Noisy Duplication Channels

Because of its high data density and longevity, DNA is emerging as a promising candidate for satisfying increasing storage needs. Compared to conventional media, however, stored in subject wider range errors resulting from various processes involved the pipeline. In this article, we consider correcting duplication both exact noisy tandem duplications given length k. An inserts copy substring k sequence immediately after that substring, e.g., ACGT ? ACGACGT, where k=3, while suffering substitution noise, ACGA TGT. Specifically, design codes can correct any number one errors, case at Hamming distance 1 original. Our constructions rely upon recovering root codeword. We characterize ways which manifest affected sequences efficient these error patterns. show proposed construction asymptotically optimal, sense it has same asymptotic rate optimal only.